Equivalent monotone versions of PRV functions
نویسندگان
چکیده
منابع مشابه
Monotone versions of δ-normality
According to Mack a space is countably paracompact if and only if its product with [0, 1] is δ-normal, i.e. any two disjoint closed sets, one of which is a regular Gδ-set, can be separated. In studying monotone versions of countable paracompactness, one is naturally led to consider various monotone versions of δ-normality. Such properties are the subject of this paper. We look at how these prop...
متن کاملMonotone cooperative games and their threshold versions
Cooperative games provide an appropriate framework for fair and stable resource allocation in multiagent systems. This paper focusses on monotone cooperative games, a class which comprises a variety of games that have enjoyed special attention within AI, in particular, skill games, connectivity games, flow games, voting games, and matching games. Given a threshold, each monotone cooperative gam...
متن کاملDifferentiation of Monotone Functions
It is clear that limy↓x f(y) ≤ limy↓x f(y). Analogously we can define limy↑x f(y) and limy↑x f(y) and we also have limy↑x f(y) ≤ limy↑x f(y). One can verify as in the sequential case that e.g. (1) limy↓x f(y) ≤ A if and only if for all > 0 there exists a δ > 0 such that f(y) < A+ for all y such that 0 < y − x < δ. (2) limy↓x f(y) ≤ A if and only if for all > 0 and δ > 0 there exists an y with 0...
متن کاملContinuity of Monotone Functions
Two refractory problems in modern constructive analysis concern real-valued functions on the closed unit interval: Is every function pointwise continuous? Is every pointwise continuous function uniformly continuous? For monotone functions, some answers are given here. Functions which satisfy a certain strong monotonicity condition, and approximate intermediate values, are pointwise continuous. ...
متن کامل2 Monotone Functions and Monotone Circuits
In the last lecture we looked at lower bounds for constant-depth circuits, proving that PARITY cannot be computed by constant-depth circuits, i.e. PARITY / ∈ AC0. General circuit lower bounds for explicit functions are quite weak: the best we can prove after years of effort is that there is a function, which requires circuits of size 5n − o(n). In this lecture we will examine what happens if we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2013
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2012.12.040